Enforcing a Semantic Routing Mechanism based on Peer Context Matching
نویسندگان
چکیده
In this paper we present the main features of the H-LINK semantic routing mechanism we are developing to combine ontology-based peer contexts and ontology matching techniques for providing P2P query forwarding on a real semantic basis. H-LINK defines a semantic overlay network where each edge represents a semantic link between two peers having similar contexts. Semantic links are exploited to address query propagation by identifying the semantic neighbors that can provide relevant knowledge with respect to a given target request.
منابع مشابه
Enforcing Routing Consistency in Structured Peer-to-Peer Overlays: Should We and Could We?
In this paper, we argue that enforcing routing consistency in keybased routing (KBR) protocols can simplify P2P application design and make structured P2P overlays suitable for more applications. We define two levels of routing consistency semantics, namely weakly consistent KBR and strongly consistent KBR. We focus on an algorithm that provides strong consistency based on group membership serv...
متن کاملExploiting Peer Ontologies for Semantic Query Propagation
A challenging issue to advance the existing P2P query propagation protocols is related to the capability of developing a routing mechanism where a semantically rich description of the context of each peer is explicitly taken into account for selecting the query recipients. In this paper, we present the H-Link semantic routing approach designed to exploit peer ontologies and ontology matchmaking...
متن کاملTowards a Managed Extensible Control Plane for Knowledge-Based Networking
This paper proposes an open, extensible control plane for a global event service, based on semantically rich messages. This is based on the novel application of control plane separation and semantic-based matching to Content-Based Networks. Here we evaluate the performance issues involved in attempting to perform ontology-based reasoning for content-based routing. This provides us with the moti...
متن کاملP2P Routing-by-Content on a Lightweight Community Basis
The effective localization of the right resources is a challenging issue at the current stage of development of P2P systems in presence of a high number of peers providing heterogeneous resource descriptions. In this paper, we present a novel approach based on lightweight communities to support routing-by-content in P2P systems. In particular, original contribution of the proposed approach rega...
متن کاملMulti-data Source Fusion Approach in Peer-to-peer Systems
In this paper, a new approach for data fusion in the context of schema-based Peer-To-Peer (P2P) systems is proposed. Schema-based systems manage and provide query capabilities for (semi-)structured information: queries have to be formulated in terms of schema. Schema-based P2P are called Peer Data Management system (PDMS). A challenging problem in a schema-based peerto-peer (P2P) system is how ...
متن کامل